Algebraic Quantum Synchronizable Codes
نویسندگان
چکیده
In this paper, we construct quantum synchronizable codes (QSCs) based on the sum and intersection of cyclic codes. Further, infinite families of QSCs are obtained from BCH and duadic codes. Moreover, we show that the work of Fujiwara [7] can be generalized to repeated root cyclic codes (RRCCs) such that QSCs are always obtained, which is not the case with simple root cyclic codes. The usefulness of this extension is illustrated via examples of infinite families of QSCs from repeated root duadic codes. Finally, QSCs are constructed from the product of cyclic codes.
منابع مشابه
Algebraic techniques in designing quantum synchronizable codes
Quantum synchronizable codes are quantum error-correcting codes that can correct the effects of quantum noise as well as block synchronization errors. We improve the previously known general framework for designing quantum synchronizable codes through more extensive use of the theory of finite fields. This makes it possible to widen the range of tolerable magnitude of block synchronization erro...
متن کاملQuantum Synchronizable Codes From Augmentation of Cyclic Codes
We propose a new method to construct quantum synchronizable codes from classical cyclic codes using the idea of augmented cyclic codes. The method augments a dual-containing cyclic code C2 to obtain another cyclic codes C1 of higher dimension. The resulting two cyclic codes and the dual code C⊥ 2 satisfy the containing property C⊥ 2 ⊂ C2 ⊂ C1. The proposed construction method based on general q...
متن کاملQuantum Block and Synchronizable Codes Derived from Certain Classes of Polynomials
One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical codes, we are able to obtain some new quantum codes. It turns out that some of quantum codes exhibited here have better parameters than the ones available i...
متن کاملOn the construction of statistically synchronizable codes
We consider the problem of constructing statistically synchronizable codes over arbitrary alphabets and for any nite source. We show how to eeciently construct a statistically synchronizable code whose average codeword length is whithin the least likely codeword probability from that of the Huuman code for the same source. Moreover, we give a method for constructing codes having a synchronizing...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1508.05977 شماره
صفحات -
تاریخ انتشار 2015